Many vessels, faulty gene

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Broadcasting with Many Faulty Links

We study the problem of broadcasting in point-to-point networks with faulty links. The usual approach in which the number of faulty links in each step is bounded by a fixed constant does not reflect the intuition that the probability of a certain link to fail while transmitting a particular message is a fixed constant. In our model the number of faulty links in a given step depends on the total...

متن کامل

Paired many-to-many disjoint path covers in faulty hypercubes

A paired many-to-many k-disjoint path cover (k-DPC for short) of a graph is a set of k disjoint paths joining k distinct source-sink pairs that cover all the vertices of the graph. Extending the notion of DPC, we define a paired many-to-many bipartite k-DPC of a bipartite graph G to be a set of k disjoint paths joining k distinct source-sink pairs that altogether cover the same number of vertic...

متن کامل

Many-to-many disjoint paths in hypercubes with faulty vertices

This paper considers the problemofmany-to-many disjoint paths in the hypercubeQn with f faulty vertices and obtains the following result. For any integer k with 1 ≤ k ≤ n − 1 and any two sets S and T of k fault-free vertices in different partite sets of Qn (n ≥ 2), if f ≤ 2n−2k−2 and each fault-free vertex has at least two fault-free neighbors, then there exist k fully disjoint fault-free paths...

متن کامل

Many-to-many Disjoint Path Covers in a Graph with Faulty Elements

In a graph G, k vertex disjoint paths joining k distinct sourcesink pairs that cover all the vertices in the graph are called a many-tomany k-disjoint path cover(k-DPC) of G. We consider an f -fault k-DPC problem that is concerned with finding many-to-many k-DPC in the presence of f or less faulty vertices and/or edges. We consider the graph obtained by merging two graphs H0 and H1, |V (H0)| = ...

متن کامل

One gene , many phenotypes

Phenotype descriptions are valuable information right at the interface of medicine and biology. With the rapid advancement in the fi eld of genetics, thousands of genes involved in human diseases have been cloned. It was expected that knowledge of mutations would lead to consistent genotype-phenotype correlations. The understanding of mechanisms underlying genotype-phenotype discrepancies is im...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Nature

سال: 1999

ISSN: 0028-0836,1476-4687

DOI: 10.1038/20309